منابع مشابه
Cacti 4.0
The original CACTI tool was released in 1994 to give computer architects a fast tool to model SRAM caches. It has been widely adopted and used since. Two new versions were released to add area and active power modeling to CACTI. This new version adds a model for leakage power and updates the basic circuit structure and device parameters to better reflect the advances in scaling semiconductors w...
متن کاملDifference labelling of cacti
A graph G is a difference graph iff there exists S ⊂ IN such that G is isomorphic to the graph DG(S) = (V,E), where V = S and E = {{i, j} : i, j ∈ V ∧ |i− j| ∈ V }. It is known that trees, cycles, complete graphs, the complete bipartite graphs Kn,n and Kn,n−1, pyramids and n-sided prisms (n ≥ 4) are difference graphs (cf. [4]). Giving a special labelling algorithm, we prove that cacti with a gi...
متن کاملEnumeration of M-ary Cacti
The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classiication of complex polynomials having at most m critical values, studied by Zvonkin and others. We obtain explicit formulae for both labelled and unlabelled m-ary cacti, according to i) the number of polygons, i...
متن کاملHitting Diamonds and Growing Cacti
We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primaldual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is Θ(logn), where n denotes the number of vertices in the ...
متن کاملCacti, Braids and Complex Polynomials
The study of the topological classiication of complex polynomials began in the XIX-th century by Luroth (1871), Clebsch (1873) and Hurwitz (1891). In the works of Zdravkovska 23] and Khovanskii and Zdravkovska 17] the problem is reduced to a purely combinatorial one, that of the study of a certain action of the braid groups on a class of tree-like gures that we, following 14], call \cacti". Usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2017
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3085572